5 Duality between constraints and gauge conditions
نویسنده
چکیده
It is shown that in the first order gauge theories under some general assumptions gauge conditions can play the role of new local symmetry generators, while the original constraints become gauge fixing terms. It is possible to associate with this new symmetry a second BRST charge and its anticommutator with the original BRST charge is the Hodge operator of the corresponding cohomology complex.
منابع مشابه
0 v 3 1 0 M ay 2 00 5 Duality between constraints and gauge conditions
It is shown that in the first order gauge theories under some general assumptions gauge conditions can play the role of new local symmetry generators, while the original constraints become gauge fixing terms. It is possible to associate with this new symmetry a second BRST charge and its anticommutator with the original BRST charge is the Hodge operator of the corresponding cohomology complex.
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملDual gauge programs, with applications to quadratic programming and the minimum-norm problem
A gauge function f(.) is a nonnegative convex function that is positively homogeneous and satisfies f(O)=O. Norms and pseudonorms are specific instances of a gauge function. This paper presents a gauge duality theory for a gauge program, which is the problem of minimizing the value of a gauge function f(.) over a convex set. The gauge dual program is also a gauge program, unlike the standard La...
متن کاملFoundations of Gauge and Perspective Duality
Common numerical methods for constrained convex optimization are predicated on efficiently computing nearest points to the feasible region. The presence of a design matrix in the constraints yields feasible regions with more complex geometries. When the functional components are gauges, there is an equivalent optimization problem—the gauge dual—where the matrix appears only in the objective fun...
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کامل